CONSTRUCTION OF SHORT-LENGTH HIGH-RATES LDPC CODES USING DIFFERENCE FAMILIES

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of Short-length High-rates Ldpc Codes Using Difference Families

Low-density parity-check (LDPC) code is linear-block error-correcting code defined by sparse parity-check matrix. It is decoded using the massage-passing algorithm, and in many cases, capable of outperforming turbo code. This paper presents a class of low-density parity-check (LDPC) codes showing good performance with low encoding complexity. The code is constructed using difference families fr...

متن کامل

On Advisability of Designing Short Length QC-LDPC Codes Using Perfect Difference Families

A simple and general definition of quasi cyclic low-density parity-check (QC-LDPC) codes which are constructed based on circulant permutation matrices (CPM) is proposed. As an special case of this definition, we first represent one type of so called combinatorially designed multiple-edge protograph codes. The code construction is mainly based on perfect difference families (PDF’s) and is called...

متن کامل

Novel Construction of Short Length Ldpc Codes for Simple Decoding

This paper introduces different construction techniques of parity-check matrix H for irregular LowDensity Parity-Check (LDPC) codes. The first one is the proposed Accurate Random Construction Technique (ARCT) which is an improvement of the Random Construction Technique (RCT) to satisfy an accurate profile. The second technique, Speed Up Technique (SUT), improves the performance of irregular LDP...

متن کامل

Quasi-cyclic LDPC codes from difference families

We consider in this paper regular and nearly regular quasi-cyclic low-density paritycheck (LDPC) codes, derived from families of difference sets. The codes have girth at least 6, and sparse parity-check matrices. They are designed to perform well when iteratively decoded with the sum-product decoding algorithm and to allow low complexity encoding.

متن کامل

High Rate LDPC Codes from Difference Covering Arrays

This paper presents a combinatorial construction of low-density parity-check (LDPC) codes from difference covering arrays. While the original construction by Gallagher was by randomly allocating bits in a sparse parity-check matrix, over the past 20 years researchers have used a variety of more structured approaches to construct these codes, with the more recent constructions of well-structured...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: MAKARA of Technology Series

سال: 2010

ISSN: 1693-6698

DOI: 10.7454/mst.v11i1.438